Tailoring 2D fast iterative filtering algorithm for low-contrast optical fringe pattern preprocessing

نویسندگان

چکیده

Retrieving object phase from the optical fringe pattern is a critical task in quantitative imaging and often requires appropriate image preprocessing (background noise minimization), especially when retrieving single-shot image. In this article, for first time, we propose to adapt 2D Fast Iterative Filtering (FIF) method decomposition develop novel version of FIF called (fpFIF2), that tailored preprocessing. We show positive influence fpFIF2 onto filtering comparing previous implementation regarding processing speed, quality, usage comfortability. also compare with other state-of-the-art methods terms aiding Hilbert spiral transform retrieval. Employing numerical simulations experimental analysis, prove outperforms reference methods, low-fringe-contrast reconstruction quality time.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive asynchronous algorithm for fringe pattern demodulation.

We present a spatial adaptive asynchronous algorithm for fringe pattern demodulation. The proposed algorithm is based on the standard five-step asynchronous method with the one modification that we select the best sample spacing for each point of the fringe pattern. As we show, the frequency response of any asynchronous method depends on the sample spacing. This interesting behavior is used to ...

متن کامل

Regularized quadratic cost function for oriented fringe-pattern filtering.

We use the regularization theory in a Bayesian framework to derive a quadratic cost function for denoising fringe patterns. As prior constraints for the regularization problem, we propose a Markov random field model that includes information about the fringe orientation. In our cost function the regularization term imposes constraints to the solution (i.e., the filtered image) to be smooth only...

متن کامل

Fast low-level pattern matching algorithm

This paper focuses on pattern matching in the DNA sequence. It was inspired by a previously reported method that proposes encoding both pattern and sequence using prime numbers. Although fast, the method is limited to rather small pattern lengths, due to computing precision problem. Our approach successfully deals with large patterns, due to our implementation that uses modular arithmetic. In o...

متن کامل

Simple Pattern Spectrum Estimation for Fast Pattern Filtering with CoCoNAD

CoCoNAD (for Continuous-time Closed Neuron Assembly Detection) is an algorithm for finding frequent parallel episodes in event sequences, which was developed particularly for neural spike train analysis. It has been enhanced by so-called Pattern Spectrum Filtering (PSF), which generates and analyzes surrogate data sets to identify statistically significant patterns, and Pattern Set Reduction (P...

متن کامل

2D Normalized Iterative Hard Thresholding Algorithm for Fast Compressive Radar Imaging

Compressive radar imaging has attracted considerable attention because it substantially reduces imaging time through directly compressive sampling. However, a problem that must be addressed for compressive radar imaging systems is the high computational complexity of reconstruction of sparse signals. In this paper, a novel algorithm, called two-dimensional (2D) normalized iterative hard thresho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Optics and Lasers in Engineering

سال: 2022

ISSN: ['1873-0302', '0143-8166']

DOI: https://doi.org/10.1016/j.optlaseng.2022.107069